منابع مشابه
Vision Algorithms for Hypercube Machines
Several commercial hypercube parallel processors with the potential to deliver massive parallelism cost-effectively have been announced recently. They open the door to a wide variety of application areas that could benefit from parallelism. Computer vision is one of these application areas. This paper develops a general model for hyper-cube machines, and uses it to show how vision algorithms ca...
متن کاملParallel Genetic Algorithms for Hypercube Machines
In this paper we investigate the design of highly parallel Genetic Algorithms. The Traveling Salesman Problem is used as a case study to evaluate and compare diierent implementations. To x the various parameters of Genetic Algorithms to the case study considered, the Holland sequential Genetic Algorithm, which adopts diierent population replacement methods and crossover operators, has been impl...
متن کاملOn Designing Genetic Algorithms for Hypercube Machines
In this paper we investigate the design of highly parallel Genetic Algorithms. The Traveling Salesman Problem is used as a case study to evaluate and compare di erent implementations. To x the various parameters of Genetic Algorithms to the case study considered, the Holland sequential Genetic Algorithm, which adopts di erent population replacement methods and crossover operators, has been impl...
متن کاملParallel Algorithms for Hypercube Allocation
Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies are easier to implement, their worst case time complexities exponentially increase as the dimension of the hypercube increases. We show that the free processors can be utilized t o perform the allocation jobs in parallel to improv...
متن کاملHypercube Algorithms for Image Transformations
Efficient hypercube algorithms are developed for the following image transformations: shrinking, expanding, translation, rotation, and scaling. A 2k−step shrinking and expanding of a gray scale N×N image can be done in O (k) time on an N2 processor MIMD hypercube and in O (logN) time on an SIMD hypercube. Translation, rotation, and scaling of an N×N image take O (logN) time on an N2 processor h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1987
ISSN: 0743-7315
DOI: 10.1016/0743-7315(87)90009-8